A Simple In-Place Algorithm for In-Shuffle
نویسنده
چکیده
The paper presents a simple, linear time, in-place algorithm for performing a 2-way in-shuffle which can be used with little modification for certain other k-way shuffles.
منابع مشابه
The Cycles of the Multiway Perfect Shuffle Permutation
The (k,n)-perfect shuffle, a generalisation of the 2-way perfect shuffle, cuts a deck of kn cards into k equal size decks and interleaves them perfectly with the first card of the last deck at the top, the first card of the second-to-last deck as the second card, and so on. It is formally defined to be the permutation ρk,n : i→ ki (mod kn + 1), i ∈ {1,2, . . . ,kn}. We uncover the cycle structu...
متن کاملA Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
We reconsider a previously published (Dalkilic et al.) algorithm for merging lists by way of the perfect shuffle permutation. The original publication gave only experimental results which, although consistent with linear execution time on the samples tested, provided no analysis. Here we prove that the time complexity, in the average case, is indeed linear, although there is a Θ(n) worst case. ...
متن کاملSoluble Expression and Purification of Q59L Mutant L-asparaginase in the Presence of Chaperones in SHuffle™ T7 strain
Background and Aims: Q59L mutant of L-asparaginase enzyme from Escherichia coli (E. coli) has been introduced with lower side effects. This version of the enzyme might have potential applications in the treatment of leukemia patients. We utilized SHuffle T7 strain of E. coli, to produce the mutant enzyme in the presence of chaperone molecules. Materials and Methods: Q59LAsp gene was cloned in...
متن کاملThe Melbourne Shuffle: Improving Oblivious Storage in the Cloud
We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can be used to improve previous oblivious storage solutions for network-based outsourcing of data.
متن کاملA Public Shuffle without Private Permutations
In TCC 2007, Adida and Wikström proposed a novel approach to shuffle, called a public shuffle, in which a shuffler can perform shuffle publicly without needing information kept secret. Their scheme uses an encrypted permutation matrix to shuffle ciphertexts publicly. This approach significantly reduces the cost of constructing a mix-net to verifiable joint decryption. Though their method is suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0805.1598 شماره
صفحات -
تاریخ انتشار 2004